A Public-key Cryptography Base on Braid Group
نویسندگان
چکیده
منابع مشابه
Braid Group Cryptography
In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. We survey these cryptosystems and some known attacks on them. This survey includes: Basic facts on braid groups and on the Garside normal form of its elements, some known algorithms for solving the word problem in the braid group, the major public-key cryp...
متن کاملThompson's Group and Public Key Cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al. exploited the conjugacy search problem in groups, which is a ramification of the discrete logarithm problem. H...
متن کاملBraid Group Cryptography Preliminary Draft
In the last decade, a number of public key cryptosystems based on combinatorial group theoretic problems in braid groups have been proposed. Our tutorial is aimed at presenting these cryptosystems and some known attacks on them. We start with some basic facts on braid groups and on the Garside normal form of its elements. We then present some known algorithms for solving the word problem in the...
متن کاملPublic key cryptography based on some extensions of group
Bogopolski, Martino and Ventura in [BMV10] introduced a general criteria to construct groups extensions with unsolvable conjugacy problem using short exact sequences. We prove that such extensions have always solvable word problem. This makes the proposed construction a systematic way to obtain finitely presented groups with solvable word problem and unsolvable conjugacy problem. It is believed...
متن کاملPublic Key Cryptography with a Group of Unknown Order
We present algorithms for digital signature generation and verification using public key cryptography over an arbitrary group G. The algorithms are similar to those of ElGamal, but do not require a knowledge of the group order. Forging signatures or determining the secret key requires the solution of a discrete logarithm problem over G, or the solution of other problems which appear at least as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/cece2017/14599